Lazy Prefetching

نویسندگان

  • Aleksandar Milenkovic
  • Veljko M. Milutinovic
چکیده

High latency of memory accesses is critical to the performance of shared memory multiprocessors. The technology trends indicate that this gap between processor and memory speeds is likely to increase in the future. To cope with memory latency problem two softwarecontrolled techniques have been investigated: prefetching and remote write. Prefetching is a consumer-initiated technique which moves data close to the processor before they are actually needed by explicit execution prefetch instruction. Remote write, a producer-initiated technique moves data close to the processor estimated to be the next consumer. However these techniques can degrade the performance in the case of misprediction of future needs and/or consumers. The new method called lazy prefetching which combines good properties of prefetching and remote write techniques is presented in this paper. The experimental methodology used for performance analysis is also described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lazy Logging and Prefetch-Based Crash Recovery in Software Distributed Shared Memory Systems

In this paper, we propose a new, efficient logging protocol, called lazy logging, and a fast crash recovery protocol, called the prefetch-based crash recovery (PCR), for software distributed shared memory (SDSM). Our lazy logging protocol minimizes failure-free overhead by logging only data indispensable for correct recovery, while our PCR protocol reduces the recovery time by prefetching data ...

متن کامل

Compiler-Directed Selective Update Mechanisms for Software Distributed Shared Memory

We estimate the performance gains of a compiler-directed selective update protocol for software distributed shared memory systems. Our base system uses an invalidate-based lazy release consistent protocol. The goal is to reduce the cost of communication, by aggregating messages, by reducing the eeects of false sharing, and by eliminating the communication of unnecessary data. We achieve our goa...

متن کامل

Streaming Flow Analyses for Prefetching in Segment-based Proxy Caching to Improve Media Delivery Quality

Segment-based proxy caching schemes have been effectively used to deliver streaming media objects. However, this approach does not always guarantee the continuous delivery because the tobe-viewed segments may not be cached in the proxy in time. The potential consequence is the playback jitter at the client side due to the proxy delay in fetching these uncached segments, thus we call the problem...

متن کامل

Taxonomy and Design Analysis for Distributed Web Caching

Proxy server caches reduce Internet traffic and improve response times. However, limited duplication among requests restricts most proxy server hit rates to under 50%, requiring other methods to expand cache sharing. This paper proposes a taxonomy for distributed network caching based on discovery, dissemination, and delivery methods. We analyze the match between taxonomy categories and Web cha...

متن کامل

A Preliminary Evaluation of Cache-miss-initiated Prefetching Techniques in Scalable Multiprocessors

Prefetching is an important technique for reducing the average latency of memory accesses in scalable cache-coherent multiprocessors. Aggressive prefetching can signiicantly reduce the number of cache misses, but may introduce bursty network and memory traac, and increase data sharing and cache pollution. Given that we anticipate enormous increases in both network bandwidth and latency, we exam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998